Approximation of the inverse Langevin function revisited

A simple and accurate approximation of the inverse Langevin function

The inverse Langevin function cannot be represented in an explicit form and requires an approximation by a series, a non-rational or a rational function as for example by a Padé approximation. In the current paper an analytical method based on the Padé technique and the multiple point interpolation is presented for the inverse Langevin function. Thus, a new simple and accurate approximation of ...

The function ring functors of pointfree topology revisited

This paper establishes two new connections between the familiar function ring functor ${mathfrak R}$ on the category ${bf CRFrm}$ of completely regular frames and the category {bf CR}${mathbf sigma}${bf Frm} of completely regular $sigma$-frames as well as their counterparts for the analogous functor ${mathfrak Z}$ on the category {bf ODFrm} of 0-dimensional frames, given by the integer-valued f...

The Fractional Langevin Equation: Brownian Motion Revisited

It is well known that the concept of diffusion is associated with random motion of particles in space, usually denoted as Brownian motion, see e.g. [1-3]. Diffusion is considered normal when the mean squared displacement of the particle during a time interval becomes, for sufficiently long intervals, a linear function of it. When this linearity breaks down, degenerating in a power law with expo...

An Approximation for the Inverse Square Root Function

Solving the Inverse Problem for Function / Image Approximation Using IFS

We are concerned with function approximation and image representation using Iterated Function Systems (IFS) over L p (X;): An N-map IFS with grey level maps (IFSM), to be denoted as (w;), is a set w of N contraction maps w i : X ! X over a compact metric space (X; d) (the \base space") with an associated set of maps i : R ! R. Associated with each IFSM is a contractive operator T with xed point...